Polluted Bootstrap Percolation in Three Dimensions

نویسندگان

  • JANKO GRAVNER
  • ALEXANDER E. HOLROYD
چکیده

In the polluted bootstrap percolation model, vertices of the cubic lattice Z are independently declared initially occupied with probability p or closed with probability q. Under the standard (respectively, modified) bootstrap rule, a vertex becomes occupied at a subsequent step if it is not closed and it has at least 3 occupied neighbors (respectively, an occupied neighbor in each coordinate). We study the final density of occupied vertices as p, q → 0. We show that this density converges to 1 if q p(log p−1)−3 for both standard and modified rules. Our principal result is a complementary bound with a matching power for the modified model: there exists C such that the final density converges to 0 if q > Cp. For the standard model, we establish convergence to 0 under the stronger condition q > Cp.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polluted Bootstrap Percolation with Threshold Two in All Dimensions

In the polluted bootstrap percolation model, the vertices of a graph are independently declared initially occupied with probability p or closed with probability q. At subsequent steps, a vertex becomes occupied if it is not closed and it has at least r occupied neighbors. On the cubic lattice Z of dimension d ≥ 3 with threshold r = 2, we prove that the final density of occupied sites converges ...

متن کامل

Semi-oriented bootstrap percolation in three dimensions

We consider the critical system size of a three dimensional semi-oriented bootstrap percolation model, constricted to a 3D cube wrapped to a torus, i.e. with periodical boundary conditions. We point out a possible form of the critical droplets for this model: occupied squares in a plane perpendicular to the primary direction of the dynamics behave as growing seeds when they are suuciently large...

متن کامل

2 7 Ju n 20 08 BOOTSTRAP PERCOLATION IN THREE DIMENSIONS

Abstract. By bootstrap percolation we mean the following deterministic process on a graph G. Given a set A of vertices ‘infected’ at time 0, new vertices are subsequently infected, at each time step, if they have at least r ∈ N previously infected neighbours. When the set A is chosen at random, the main aim is to determine the critical probability pc(G, r) at which percolation (infection of the...

متن کامل

Bootstrap Percolation in Three Dimensions

Abstract. By bootstrap percolation we mean the following deterministic process on a graph G. Given a set A of vertices ‘infected’ at time 0, new vertices are subsequently infected, at each time step, if they have at least r ∈ N previously infected neighbours. When the set A is chosen at random, the main aim is to determine the critical probability pc(G, r) at which percolation (infection of the...

متن کامل

The Time of Bootstrap Percolation in Two Dimensions

We study the distribution of the percolation time T of 2-neighbour bootstrap percolation on [n] with initial set A ∼ Bin([n], p). We determine T up to a constant factor with high probability for all p above the critical probability for percolation, and to within a 1 + o(1) factor for a large range of p.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017